Equivalence Checking of Dissimilar Circuits II
نویسنده
چکیده
In this report we revisit the theory introduced in [2]. We formulate it in terms of correlation functions so showing that the introduction of filtering functions is not necessary. We also describe an algorithm of equivalence checking for circuits with a known specification that is based on computation of correlation functions only (no filtering functions are computed).
منابع مشابه
Equivalence Checking of Dissimilar Circuits
We introduce the notion of a Common Specification of circuits that generalizes the current notion of structural similarity. A CS S of circuits N1 and N2 is a circuit of multi-valued blocks from which N1 and N2 can be produced by binary encoding. We show that the equivalence checking of N1,N2 in general resolution (which a non-deterministic proof system) is linear in the number of blocks in S. H...
متن کاملEquivalence Checking of Combinational Circuit Using Chaotic Pattern Simulation and Binary Decision Diagrams
With the increase of complexity of circuits, guaranteeing the correctness of design becomes extremely important. A new equivalence checking method is presented in this paper for the verifications of combinational circuits; the method uses the chaotic pattern simulation to find a lot of equivalent nodes, which results in that the scale of the composite circuit is reduced. The equivalence checkin...
متن کاملSequential equivalence checking based on structural similarities
Checking the functional equivalence of sequential circuits is an important practical problem. Because general algorithms for solving this problem require a state-space traversal of the product machine, they are computationally expensive. In this paper, we present a new method for sequential equivalence checking which utilizes functionally equivalent signals to prove the equivalence of both circ...
متن کاملEquivalence checking of combinational circuits using Boolean expression diagrams
The combinational logic-level equivalence problem is to determine whether two given combinational circuits implement the same Boolean function. This problem arises in a number of CAD applications, for example when checking the correctness of incremental design changes (performed either manually or by a design automation tool). This paper introduces a data structure called Boolean Expression Dia...
متن کاملEquivalence checking using Gröbner bases
Motivated by the recent success of the algebraic computation technique in formal verification of large and optimized gate-level multipliers, this paper proposes algebraic equivalence checking for handling circuits that contain both complex arithmetic components as well as control logic. These circuits pose major challenges for existing proof techniques. The basic idea of Algebraic Combinational...
متن کامل